The rook partition algebra

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The rook partition algebra

The rook partition algebra RPk(x) is a semisimple algebra for all but a finite number of values of x ∈ C that arises from looking at what commutes with the action of the symmetric group Sn on U ⊗k, where U is the direct sum of the natural representation and the trivial representation of Sn. We give a combinatorial description of this algebra, construct its irreducible representations, and exhib...

متن کامل

Representations of the Rook-Brauer Algebra

We study the representation theory of the rook-Brauer algebra RBk(x), which has a of Brauer diagrams that allow for the possibility of missing edges. The Brauer, Temperley-Lieb, Motzkin, rook monoid, and symmetric group algebras are subalgebras of RBk(x). We prove that RBk(n+1) is the centralizer of the orthogonal group On(C) on tensor space and that RBk(n+1) and On(C) are in Schur-Weyl duality...

متن کامل

q-Partition algebra combinatorics

We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector space IR q coming from r-iterations of Harish-Chandra restriction and induction. For n ≥ 2r, we show that Qr(n, q) has the same semisimple matrix structure as Pr(n). We compute the dimension dn,r(q) = dim(IR r q ) to be...

متن کامل

Partition Analysis, Modular Functions, and Computer Algebra

This article describes recent developments connecting problems of enumerative combinatorics, constrained by linear systems of Diophantine inequalities, with number theory topics like partitions, partition congruences, and q-series identities. Special emphasis is put on the role of computer algebra algorithms. The presentation is intended for a broader audience; to this end, elementary introduct...

متن کامل

Applying Relation Partition Algebra for Reverse Architecting

The ever increasing complexity and ever more rapidly changing requirements for software systems create a need for reuse and adaptation of existing software. An explicit description of the software architecture of a system may help to get a high-level overview of the system, thus facilitating re-use and adaptation of the system. Reverse architecting is a technique applied within Philips to make ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2006

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2005.03.006